Computability of 1-manifolds

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computability of 1-manifolds

A semi-computable set S in a computable metric space need not be computable. However, in some cases, if S has certain topological properties, we can conclude that S is computable. It is known that if a semi-computable set S is a compact manifold with boundary, then the computability of ∂S implies the computability of S. In this paper we examine the case when S is a 1-manifold with boundary, not...

متن کامل

Degrees of Computability(1)

Introduction. In the theory of recursive functions, several decision problems have been proved unsolvable. A decision problem arises when we are confronted with a set TV of mathematical objects and a subset S of 7Y. We desire a mechanical procedure which will operate on elements of TV, determining if they are elements of 5. Now, we can operate on a mathematical object using such an effective pr...

متن کامل

Computability of semicomputable manifolds in computable topological spaces

We study computable topological spaces and semicomputable and computable sets in these spaces. In particular, we investigate conditions under which semicomputable sets are computable. We prove that a semicomputable compact manifold M is computable if its boundary ∂M is computable. We also show how this result combined with certain construction which compactifies a semicomputable set leads to th...

متن کامل

on 1-manifolds and 2-manifolds

in this work, different types of chaotic 1-manifolds which lie on the chaotic spheres or on a torus are introduced. some types of retractions of the chaotic spheres affect on the 1-chaotic systems, and other types of retractions occur to the geometric manifold but make the 1-chaotic manifold invariant. the existed retractions are discussed through new proved theorems. also we construct diffe...

متن کامل

Gödel and Computability 1

We discuss the influence of Gödel and his results on the surfacing of the rigorous notion of computability afforded by Turing. We also address the debate about the limits of Artificial Intelligence spurned by Roger Penrose, on the basis of Gödel's theorems, and the views of Gödel himself. We conclude by touching upon the use of logic as a tool with which to approach the description of mind.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Logical Methods in Computer Science

سال: 2014

ISSN: 1860-5974

DOI: 10.2168/lmcs-10(2:8)2014